UnivTrevesV1, LNCS, Analysis, bibRecord, 000218

Synchronized Tree Languages Revisited and New Applications

Identifieur interne : 000218 ( LNCS/Analysis ); précédent : 000217; suivant : 000219

Synchronized Tree Languages Revisited and New Applications

Auteurs : Valérie Gouranton [France] ; Pierre Réty [France] ; Helmut Seidl [Allemagne]

Source :

Lecture Notes in Computer Science [ 0302-9743 ] ; 2001.

RBID : ISTEX:D0F06663F37BD2DA6FD46040AAABE57C9E035ED8

Descripteurs français

Pascal (Inist)
- Arbre graphe, Décidabilité, Interblocage, Langage programmation, Réécriture, Simultanéité, Structure arborescente.
Wicri :
- topic : Langage de programmation.

English descriptors

KwdEn :
- Deadlock, Decidability, Programming language, Rewriting, Simultaneity, Tree structure, Tree(graph).

Abstract

Abstract: We present a new formulation for tree-tuple synchronized languages, much simpler than the existing one. This new formulation allows us to prove stronger structural results. As a consequence, synchronized languages give rise to new applications: — to rewriting: given tree languages L 1 (synchronized), L 2 (regular), Rel(L 1) ⊆ L 2 is decidable for several rewrite-like relations Rel. — to concurrency: we prove decidability of the logic EF for a process calculus allowing some bounded form of communication. Consequently, the absence of deadlocks is decidable.

Url:

https://api.istex.fr/document/D0F06663F37BD2DA6FD46040AAABE57C9E035ED8/fulltext/pdf

DOI: 10.1007/3-540-45315-6_14

Affiliations:

Links to Exploration step

ISTEX:D0F06663F37BD2DA6FD46040AAABE57C9E035ED8

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Synchronized Tree Languages Revisited and New Applications</title>
<author><name sortKey="Gouranton, Valerie" sort="Gouranton, Valerie" uniqKey="Gouranton V" first="Valérie" last="Gouranton">Valérie Gouranton</name>
</author>
<author><name sortKey="Rety, Pierre" sort="Rety, Pierre" uniqKey="Rety P" first="Pierre" last="Réty">Pierre Réty</name>
</author>
<author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:D0F06663F37BD2DA6FD46040AAABE57C9E035ED8</idno>
<date when="2001" year="2001">2001</date>
<idno type="doi">10.1007/3-540-45315-6_14</idno>
<idno type="url">https://api.istex.fr/document/D0F06663F37BD2DA6FD46040AAABE57C9E035ED8/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001136</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001136</idno>
<idno type="wicri:Area/Istex/Curation">001025</idno>
<idno type="wicri:Area/Istex/Checkpoint">000C17</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000C17</idno>
<idno type="wicri:doubleKey">0302-9743:2001:Gouranton V:synchronized:tree:languages</idno>
<idno type="wicri:Area/Main/Merge">002087</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:01-0248413</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000E41</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000116</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000B78</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000B78</idno>
<idno type="wicri:doubleKey">0302-9743:2001:Gouranton V:synchronized:tree:languages</idno>
<idno type="wicri:Area/Main/Merge">002134</idno>
<idno type="wicri:Area/Main/Curation">001E13</idno>
<idno type="wicri:Area/Main/Exploration">001E13</idno>
<idno type="wicri:Area/LNCS/Extraction">000218</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Synchronized Tree Languages Revisited and New Applications</title>
<author><name sortKey="Gouranton, Valerie" sort="Gouranton, Valerie" uniqKey="Gouranton V" first="Valérie" last="Gouranton">Valérie Gouranton</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>LIFO, Université d’Orléans</wicri:regionArea>
<wicri:noRegion>Université d’Orléans</wicri:noRegion>
<wicri:noRegion>Université d’Orléans</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Rety, Pierre" sort="Rety, Pierre" uniqKey="Rety P" first="Pierre" last="Réty">Pierre Réty</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>LIFO, Université d’Orléans</wicri:regionArea>
<wicri:noRegion>Université d’Orléans</wicri:noRegion>
<wicri:noRegion>Université d’Orléans</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
<affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Dept. of Computer Science, University of Trier</wicri:regionArea>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
<orgName type="university">Université de Trèves</orgName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2001</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">D0F06663F37BD2DA6FD46040AAABE57C9E035ED8</idno>
<idno type="DOI">10.1007/3-540-45315-6_14</idno>
<idno type="ChapterID">14</idno>
<idno type="ChapterID">Chap14</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Deadlock</term>
<term>Decidability</term>
<term>Programming language</term>
<term>Rewriting</term>
<term>Simultaneity</term>
<term>Tree structure</term>
<term>Tree(graph)</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Arbre graphe</term>
<term>Décidabilité</term>
<term>Interblocage</term>
<term>Langage programmation</term>
<term>Réécriture</term>
<term>Simultanéité</term>
<term>Structure arborescente</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Langage de programmation</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We present a new formulation for tree-tuple synchronized languages, much simpler than the existing one. This new formulation allows us to prove stronger structural results. As a consequence, synchronized languages give rise to new applications: — to rewriting: given tree languages L 1 (synchronized), L 2 (regular), Rel(L 1) ⊆ L 2 is decidable for several rewrite-like relations Rel. — to concurrency: we prove decidability of the logic EF for a process calculus allowing some bounded form of communication. Consequently, the absence of deadlocks is decidable.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
<li>France</li>
</country>
<region><li>Rhénanie-Palatinat</li>
</region>
<settlement><li>Trèves (Allemagne)</li>
</settlement>
<orgName><li>Université de Trèves</li>
</orgName>
</list>
<tree><country name="France"><noRegion><name sortKey="Gouranton, Valerie" sort="Gouranton, Valerie" uniqKey="Gouranton V" first="Valérie" last="Gouranton">Valérie Gouranton</name>
</noRegion>
<name sortKey="Gouranton, Valerie" sort="Gouranton, Valerie" uniqKey="Gouranton V" first="Valérie" last="Gouranton">Valérie Gouranton</name>
<name sortKey="Rety, Pierre" sort="Rety, Pierre" uniqKey="Rety P" first="Pierre" last="Réty">Pierre Réty</name>
<name sortKey="Rety, Pierre" sort="Rety, Pierre" uniqKey="Rety P" first="Pierre" last="Réty">Pierre Réty</name>
</country>
<country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
</region>
<name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000218 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000218 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    LNCS
   |étape=   Analysis
   |type=    RBID
   |clé=     ISTEX:D0F06663F37BD2DA6FD46040AAABE57C9E035ED8
   |texte=   Synchronized Tree Languages Revisited and New Applications
}}

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024

Serveur d'exploration sur l'Université de Trèves

Synchronized Tree Languages Revisited and New Applications

Synchronized Tree Languages Revisited and New Applications

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur l'Université de Trèves
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.